A note on single-machine group scheduling problems with position-based learning effect
نویسندگان
چکیده
منابع مشابه
A note on "Single-machine scheduling with general learning functions"
The recent paper ‘‘Single-machine scheduling with general learning functions’’ (Wang [1]) addresses the single-machine scheduling problems with a sum-of-processing-times-based learning effect. The author showed that that the shortest processing time (SPT) rule is optimal for the sum of completion times square minimization problem. He also showed by examples that the optimal schedule for the cla...
متن کاملA Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems
In this note, we investigate the effects of deterioration and learning in single-machine scheduling problems. Although the learning effect and the concept of deteriorating jobs have been extensively studied, they have never been considered simultaneously. It is shown in several examples that the optimal schedule of the problem may be different from that of the classical one. Nevertheless, the m...
متن کاملSome Single - Machine Scheduling Problems with a Mixed Learning Function
Recently, the topic of scheduling with learning effects has kept growing attention, and a survey is further provided to classify the learning models in scheduling into two types, namely position-based learning and sum-ofprocessingtimes-based learning. However, the actual processing time of a given job fast drops to zero as the number of jobs increases in the first model and when the normal job ...
متن کاملSingle-machine group scheduling problems with deterioration consideration
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job deterioration is relatively unexplored in the context of group technology. In this paper, we consider deterioration in the framework ofminimizing themakespan and the total completion time in single-machine group sched...
متن کاملSingle Machine Scheduling Problems with Time-dependent Learning Effects
In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of the job in a sequence. In such situations, the actual processing time of a job may be more or less than its normal processing time if it is scheduled later. This phenomenon is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2009
ISSN: 0307-904X
DOI: 10.1016/j.apm.2008.05.020